On the Binomial Moments of Linear Codes and Undetected Error Probability
نویسنده
چکیده
The binomial moments of a linear code are synonymously related to its weight distribution and appear naturally in studies involving the weight distribution of the code. In particular , the binomial moments have been used for establishing bounds on the undetected error probability and, though implicitly, for the study of good and proper codes. In this work we sharpen known bounds on the binomial moments of a linear code. One consequence of this sharpening is a simple algorithm for computing the dual code distance via the binomial moments of the code. Also, we derive inequalities for the undetected error probability and simplify some previously known suucient conditions for good and proper codes.
منابع مشابه
Undetected error probabilities of binary primitive BCH codes for both error correction and detection
In this paper, we investigate the undetected error probabilities for bounded-distance decoding of binary primitive BCH codes when they are used for both error correction and detection on a binary symmetric channel. We show that the undetected error probability of binary linear codes can be quite simplified and quantified if weight distribution of the code is binomial-like. We obtain bounds on t...
متن کاملQuantum error detection I: Statement of the problem
This paper is devoted to the problem of error detection with quantum codes. In the first part we examine possible problem settings for quantum error detection. Our goal is to derive a functional that describes the probability of undetected error under natural physical assumptions concerning transmission with error detection with quantum codes. We discuss possible transmission protocols with sta...
متن کاملThe best possible upper bound on the probability of undetected error for linear codes of full support
Abstract—There is a known best possible upper bound on the probability of undetected error for linear codes. The [n, k; q] codes with probability of undetected error meeting the bound have support of size k only. In this note, linear codes of full support (= n) are studied. A best possible upper bound on the probability of undetected error for such codes is given, and the codes with probability...
متن کاملOn the properness of some optimal binary linear codes and their dual codes
A linear code is said to be proper in error detection over a symmetric memoryless channel if its undetected error probability is an increasing function of the channel symbol error probability. A proper code performs well in error detection in the sense that the better the channel, the better the performance, which makes the code appropriate for use in channels where the symbol error probability...
متن کاملQuantum error detection II: Bounds
In Part I of this paper we formulated the problem of error detection with quantum codes on the completely depolarized channel and gave an expression for the probability of undetected error via the weight enumerators of the code. In this part we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this expo...
متن کامل